Spherical Two-Distance Sets and Eigenvalues of Signed Graphs

نویسندگان

چکیده

Abstract We study the problem of determining maximum size a spherical two-distance set with two fixed angles (one acute and one obtuse) in high dimensions. Let $$N_{\alpha ,\beta }(d)$$ N α , β ( d ) denote number unit vectors $${\mathbb {R}}^d$$ R where all pairwise inner products lie $$\{\alpha \}$$ { } . For $$-1\le \beta<0\le \alpha <1$$ - 1 ≤ < 0 , we propose conjecture for limit }(d)/d$$ / as $$d \rightarrow \infty $$ → ∞ terms eigenvalue multiplicities signed graphs. determine this when $$\alpha +2\beta <0$$ + 2 or $$(1-\alpha )/(\alpha -\beta ) \in \{1, \sqrt{2}, \sqrt{3}\}$$ ∈ 3 Our work builds on our recent resolution case = = (corresponding to equiangular lines). It is first determination $$\lim _{d } N_{\alpha lim any nontrivial values $$\beta outside lines setting.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Spherical two-distance sets

A set S of unit vectors in n−dimensional Euclidean space is called spherical two-distance set, if there are two numbers a and b so that the inner products of distinct vectors of S are either a or b. The largest cardinality g(n) of spherical two-distance sets does not exceed n(n+3)/2. This upper bound is known to be tight for n = 2, 6, 22. The set of midpoints of the edges of a regular simplex g...

متن کامل

On the distance eigenvalues of Cayley graphs

In this paper, we determine the distance matrix and its characteristic polynomial of a Cayley graph over a group G in terms of irreducible representations of G. We give exact formulas for n-prisms, hexagonal torus network and cubic Cayley graphs over abelian groups. We construct an innite family of distance integral Cayley graphs. Also we prove that a nite abelian group G admits a connected...

متن کامل

Signed degree sets in signed bipartite graphs

A signed bipartite graph G(U, V) is a bipartite graph in which each edge is assigned a positive or a negative sign. The signed degree of a vertex x in G(U, V) is the number of positive edges incident with x less the number of negative edges incident with x. The set S of distinct signed degrees of the vertices of G(U, V) is called its signed degree set. In this paper, we prove that every set of ...

متن کامل

New Bounds for Equiangular Lines and Spherical Two-Distance Sets

The set of points in a metric space is called an s-distance set if pairwise distances between these points admit only s distinct values. Two-distance spherical sets with the set of scalar products {α,−α}, α ∈ [0, 1), are called equiangular. The problem of determining the maximal size of s-distance sets in various spaces has a long history in mathematics. We determine a new method of bounding th...

متن کامل

Symplectic matroids, independent sets, and signed graphs

We give an independent set axiomatization of symplectic matroids, a large and important class of Coxeter matroids. As an application, we construct a new class of examples of symplectic matroids from graphs. As another application, we prove that symplectic matroids satisfy a certain “basis exchange property,” and we conjecture that this basis exchange property in fact characterizes symplectic ma...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Combinatorica

سال: 2023

ISSN: ['0209-9683', '1439-6912']

DOI: https://doi.org/10.1007/s00493-023-00002-1